Projections of Antichains
نویسندگان
چکیده
منابع مشابه
Embedded antichains in tournaments
The maximum antichain cardinality (MACC) of a tournament is the maximum number of incomparable subtournaments of T . We establish some properties of MACC. We describe all tournaments whose MACC is 1 or 2, show that MACC can grow exponentially with the size of the vertex set of a tournament, and present some questions for further investigation.
متن کاملOn canonical antichains
An antichain A of a well-founded quasi-order (E,≤) is canonical if for every finite subset A0 of A, all antichains of E\{x : x ≥ a for some a in A\A0} are finite. In this paper, we characterize those quasi-orders that have a canonical antichain. Guoli Ding, On canonical antichains, (July 20, 1994) 1
متن کاملWhen Simulation Meets Antichains
We describe a new and more efficient algorithm for checking universality and language inclusion on nondeterministic finite word automata (NFA) and tree automata (TA). To the best of our knowledge, the antichain-based approach proposed by De Wulf et al. was the most efficient one so far. Our idea is to exploit a simulation relation on the states of finite automata to accelerate the antichain-bas...
متن کاملMaximum Antichains of Rectangular Arrays
Given a finite partially ordered set B, it is often of interest to describe the largest possible subsets SC B which consist of mutually incomparable elements of B. Such subsets are usually called maximum antichains or maximum Sperner families of .P after Sperner [I 51, who first characterized these maximum antichains in the case that 9 is a finite Boolean lattice, i.e., the set of all subsets o...
متن کاملAntichains of Multisets
The problem of enumeration of m-antichains of k-bounded multisets on an n-set is considered. A formula for calculating the cardinality of the corresponding family in terms of the graph theory was obtained. A more general case of multiantichains is also considered. As an illustration the corresponding explicit formulas are given for the case when 1 ≤ m ≤ 4, k ≥ 1 and n ≥ 0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/9174